Organisational Social Influence on Directed Hierarchical Graphs, from Tyranny to Anarchy
نویسندگان
چکیده
منابع مشابه
Influence in Terrorist Networks: From Undirected to Directed Graphs
A methodology for converting terrorist networks from undirected graphs to simplified directed graphs (or digraphs), and mapping the flow of influence in them, is described. It is based on an “influence assumption”—that important personswithmore links influence less important persons with fewer links. This methodology, which was previously used to analyze the structure of influence relationships...
متن کاملFrom Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...
متن کاملHierarchical alignment of weighted directed acyclic graphs
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These structural relationships defined by the hierarchy in the graphs act as a constraint on the alignment. In this paper, we formalize this problem as the weighted alignm...
متن کاملA 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes and into k ≥ 2 subsets, called walls, and also drawn in parallel planes. The planes of set of the walls are perpendicular to the planes of the layers. We present a method for computing such layouts and introduce five a...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2020
ISSN: 2045-2322
DOI: 10.1038/s41598-020-61196-8